• Optimization with linear programming featured problem-specific formulations and integer considerations, including cutting-stock, economic lot sizing, and knapsack variants, illustrating early deployment of LP in industry [1], [6], [3], [19], [20].

• Foundational algorithms for combinatorial optimization—routing and sequencing—with branch-and-bound, 1-tree concepts, and dynamic programming shaping early TSP and related problems [5], [4], [12], [7].

• Emergence of 0-1 integer programming solution methods, including additive and Balas-type implicit enumeration, marking major steps toward exact discrete optimization [2], [11], [17], [18].

• Optimization theory foundations for resource allocation and decision-making, via generalized Lagrange multipliers, sequential decision processes, and fuzzy decision frameworks [14], [20], [15], [16].